#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int main(void)
{
  ///cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;t=read();
  while(t--){
     LL x,y;x=read();y=read();
     LL ans=0;
     for(LL b=1;b<=y;b++){
          if(b*(b-1)+b<=x){
             ans+=(b-1);
          }
          else{
              LL l=0;LL r=1e9;
              while(l<r){
                LL mid=(l+r+1)>>1;
                if(mid*b+mid<=x) l=mid;
                else r=mid-1;
              }
              ans+=l;
          }
          if(b*b>1e13) break;
     }
     printf("%lld\n",ans);
  }
return 0;
}
